Elliptic Subcovers of Hyperelliptic Curves
نویسنده
چکیده
Let C be a curve over an arbitrary fieldK. An elliptic subcover is a finiteK-morphism f : C → E to an elliptic curve E/K such that its base-change fK : CK → EK to the algebraic closure does not factor over a non-trivial isogeny of EK . If f ′ : C → E ′ is another elliptic subcover, then f ′ is said to be equivalent to f if there is an isomorphism φ : E ∼ → E ′ such that f ′ = φ ◦ f . Let E(C) denotes the set of all equivalence classes of elliptic subcovers of C. If C(K) 6= ∅, then it is well-known that there is a natural bijection between the set E(C) and the set S(JC) of elliptic subgroups of the Jacobian JC of C. The purpose of this paper is to show that this result is also true when C(K) = ∅, provided that C is a hyperelliptic curve whose genus is even. Thus, we prove in §4: Theorem 1.1. Let C/K be a hyperelliptic curve of genus gC ≡ 0 (2). Then the rule f 7→ f JE induces a bijection ΦC : E(C) ∼ → S(JC).
منابع مشابه
Elliptic curves with weak coverings over cubic extensions of finite fields with odd characteristic
In this paper, we present a classification of elliptic curves defined over a cubic extension of a finite field with odd characteristic which have coverings over the finite field therefore subjected to the GHS attack. The densities of these weak curves, with hyperelliptic and non-hyperelliptic coverings, are then analyzed respectively. In particular, we show, for elliptic curves defined by Legen...
متن کاملHyperelliptic Pairings
We survey recent research on pairings on hyperelliptic curves and present a comparison of the performance characteristics of pairings on elliptic curves and hyperelliptic curves. Our analysis indicates that hyperelliptic curves are not more efficient than elliptic curves for general pairing applications.
متن کاملExplicit p-adic methods for elliptic and hyperelliptic curves
We give an overview of some p-adic algorithms for computing with elliptic and hyperelliptic curves, starting with Kedlaya’s algorithm. While the original purpose of Kedlaya’s algorithm was to compute the zeta function of a hyperelliptic curve over a finite field, it has since been used in a number of applications. In particular, we describe how to use Kedlaya’s algorithm to compute Coleman inte...
متن کاملScholten Forms and Elliptic/Hyperelliptic Curves with Weak Weil Restrictions
In this paper, we show explicitly the classes of elliptic and hyperelliptic curves of low genera dened over extension elds, which have weak coverings , i.e. their Weil restrictions can be attacked by either index calculus attacks to hyperelliptic curves or Diem's recent attack to non-hyperelliptic curves. In particular, we show how to construct such c o v erings from these curves and analyze de...
متن کاملHyperelliptic Curve Cryptography
The use of elliptic-curve groups in cryptography, suggested by Miller [1] and Koblitz [2] three decades ago,provides the same level of security for the Discrete Logarithm Problem as multiplicative groups, with much smallerkey sizes and parameters. The idea was refined two years later by Koblitz, who worked with the group formed bythe points of the Jacobian of hyperelliptic curve...
متن کامل